Assortativity evolving from social dilemmas.

نویسندگان

  • Heinrich H Nax
  • Alexandros Rigos
چکیده

Assortative mechanisms can overcome tragedies of the commons that otherwise result in dilemma situations. Assortativity criteria include various forms of kin selection, greenbeard genes, and reciprocal behaviors, usually presuming an exogenously fixed matching mechanism. Here, we endogenize the matching process with the aim of investigating how assortativity itself, jointly with cooperation, is driven by evolution. Our main finding is that full-or-null assortativities turn out to be long-run stable in most cases, independent of the relative speeds of both processes. The exact incentive structure of the underlying social dilemma matters crucially. The resulting social loss is evaluated for general classes of dilemma games, thus quantifying to what extent the tragedy of the commons may be endogenously overcome.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolution of Cooperation in Social Dilemmas on Complex Networks

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution...

متن کامل

Social dilemmas in an online social network: The structure and evolution of cooperation

We investigate two paradigms for studying the evolution of cooperation—Prisoner’s Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two...

متن کامل

Self-learning Mutual Selection Model for Weighted Networks

In this paper, we propose a self-learning mutual selection model to characterize weighted evolving networks. By introducing the self-learning probability p and the general mutual selection mechanism, which is controlled by the parameter m, the model can reproduce scale-free distributions of degree, weight and strength, as found in many real systems. The simulation results are consistent with th...

متن کامل

Shared intentions: The evolution of collaboration

The ability to share intentions and adjust one’s choices in collaboration with others is a fundamental aspect of human nature. We discuss the forces that would have acted for and against the evolution of this ability for a large class of dilemmas and coordination problems that would have been faced by our hominin ancestors. In contrast to altruism and other non-fitness maximizing preferences, t...

متن کامل

The preferences of Homo Moralis are unstable under evolving assortativity

Differing degrees of assortativity in matching can be expected to have both genetic and cultural determinants. When assortativity is subject to evolution, the main result of Alger and Weibull (2013) on the evolution of stable otherregarding preferences does not hold. Instead, both non-Nash and Pareto inefficient behavior are evolutionarily unstable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of theoretical biology

دوره 395  شماره 

صفحات  -

تاریخ انتشار 2016